Перевод: с английского на все языки

со всех языков на английский

left divisor

См. также в других словарях:

  • Divisor summatory function — The summatory function, with leading terms removed, for x < 104 …   Wikipedia

  • Divisor — Der Begriff des Divisors spielt in der Algebraischen Geometrie und der Komplexen Analysis eine wichtige Rolle bei der Untersuchung Algebraischer Varietäten bzw. Komplexer Mannigfaltigkeiten und der darauf definierten Funktionen. Unterschieden… …   Deutsch Wikipedia

  • Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For …   Wikipedia

  • Zero divisor — In abstract algebra, a nonzero element a of a ring is a left zero divisor if there exists a nonzero b such that ab = 0.[1] Similarly, a nonzero element a of a ring is a right zero divisor if there exists a nonzero c such that ca = 0. An element… …   Wikipedia

  • Greatest common divisor of two polynomials — Informally, the greatest common divisor (GCD) of two polynomials p ( x ) and q ( x ) is the biggest polynomial that divides evenly into both p ( x ) and q ( x ). The definition is modeled on the concept of the greatest common divisor of two… …   Wikipedia

  • Topological divisor of zero — In mathematics, in a topological algebra A , zin A is a topological divisor of zero if there exists a neighbourhood U of zero and a net (x i) {iin I} with forall iin I, x i in Asetminus U and zx i longrightarrow Oin A. If the topological algebra… …   Wikipedia

  • Máximo común divisor — En matemáticas el máximo común divisor (abreviado MCD) de dos o más números enteros es el mayor número que los divide sin dejar resto. Por ejemplo, el MCD de 42 y 56 es 14. En efecto, y y son primos entre sí (no existe ningún número natural… …   Wikipedia Español

  • Fresadora — universal con sus accesorios …   Wikipedia Español

  • Counterfeit coin problem — Information theory was created in 1948 by Claude Shannon. This theory has notably enriched the field of research into mathematics, economics, biology, psychology, semantics, etc. As an example, this theory recently contributed to quantum… …   Wikipedia

  • Divisibility rule — A divisibility rule is a shorthand way of discovering whether a given number is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, and… …   Wikipedia

  • Modulo operation — Quotient (red) and remainder (green) functions using different algorithms. In computing, the modulo operation finds the remainder of division of one number by another. Given two positive numbers, a (the dividend) and n (the divisor), a modulo n… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»